منابع مشابه
Some Bounds on Alliances in Trees
Given a simple graph G = (V,E), a subset S of the vertices is called a global defensive alliance if S is a dominating set and for every vertex v in S at least half of the vertices in the closed neighborhood of v are in S. Similarly, a subset S is called a global offensive alliance if S is a dominating set and for every vertex v not in S at least half of the vertices in the closed neighborhood o...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملon some bayesian statistical models in actuarial science with emphasis on claim count
چکیده ندارد.
15 صفحه اولOn defensive alliances and strong global offensive alliances
We consider complexity issues and upper bounds for defensive alliances and strong global offensive alliances in graphs. We prove that it is NP-complete to decide for a given 6-regular graph G and a given integer a, whether G contains a defensive alliance of order at most a. Furthermore, we prove that determining the strong global offensive alliance number γô(G) of a graph G is APX-hard for cubi...
متن کاملGlobal Alliances and Independent Domination in Some Classes of Graphs
A dominating set S of a graph G is a global (strong) defensive alliance if for every vertex v ∈ S, the number of neighbors v has in S plus one is at least (greater than) the number of neighbors it has in V \ S. The dominating set S is a global (strong) offensive alliance if for every vertex v ∈ V \ S, the number of neighbors v has in S is at least (greater than) the number of neighbors it has i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 1985
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.291.6511.1796